Computer-implemented method and electronic device for detecting influential components in a netlist representing an electrical circuit

ABSTRACT

A computer-implemented method and an electronic device for detecting, in an electrical circuit with electrical components (M g ) subject to variations (δ) of their model parameters (x j ), those components (M g *) the model parameter variations (δ) of which have the strongest influence on a performance (y n ) of the circuit, comprising: providing a topology (Q) of the circuit and the model parameters (x j ) of all components (M g ) therein; determining, therefrom, topological patterns (P k ) of interconnected components (M g ); generating variation samples (v n ), each comprising a different set of candidate variations (x′ j ) of the model parameters (x j ); calculating, for each variation sample (v n ), the circuit&#39;s performance (y n ) and a deviation from a standard performance and forming a deviation vector (y D ) therefrom; and using the variation samples (v n ), the deviation vector (y D ) and the topological patterns (P k ) in a regression model for detecting the most influential components (M g *).

This application is a 35 U.S.C. § 371 national phase filing of International Application No. PCT/EP2019/074226, filed on Sep. 11, 2019 and claiming benefit of European Patent Application No. 18193797.0 filed on Sep. 11, 2018, wherein the disclosures of the foregoing applications are hereby incorporated by reference herein in their respective entireties.

The present invention relates to a computer-implemented method, a computer-readable medium and an electronic device for detecting, in a netlist representing an electrical circuit with electrical components subject to variations of their parameters, those components the parameter variations of which have the strongest influence on a performance of the circuit.

Electrical circuits may be of conventional discrete type or more often today of microelectronic type and sometimes comprise several thousands or even hundreds of thousands of electrical components. Each electrical component may have two or more terminals which are interconnected with terminals of some of the other components in the electrical circuit. The electrical behaviour of each component is described through a mathematical model, i.e. a “component model”, which includes one or more parameters of the component. Typically, the parameters are defined in the component model used, such as the well-known BSIM model for MOSFET transistors. Other commonly used models include BSIM3, BSIM4, BSIMSOI, PSP, HICUM, or MEXTRAM. The parameters could be electrical parameters, such as threshold voltage, flat band voltage, Drain-Induced Barrier Lowering (DIBL) or subthreshold swing, as well as process parameters such as the substrate doping, gate oxide thickness, or gate length. Typically the component models offer a limited number of model parameters which should be adjusted by the designer of the circuit such as the gate length or the gate width. However, the rest of the model parameters such as the doping profiles and the gate oxide thickness depend on the semiconductor process technology and should not be touched by the designer.

When designing an electrical circuit the parameters of the components are known in advance or predefined by an electrical circuit designer. Based on the model parameters and the interconnection of the components in the electrical circuit, the performance of the electrical circuit can be calculated by the circuit simulator. The circuit simulator, e.g., “SPICE” or similar tools, mathematically solves network equations derived according to the component models, the model parameters and the component interconnections. When the calculated performance of the designed electrical circuit is satisfactory, the circuit should be ready for manufacturing.

However, due to inevitable inaccuracies in the manufacturing process of the electrical circuit and each component therein the parameters of the components are subject to variations which affect the performance of the electrical circuit. Generally, these parameter variations are characterized in form of a statistical model, e.g., a probability distribution. Hence, the variations can be simulated prior to manufacturing by calculating the performance of the electrical circuit in respect of the parameter variations. Thereby, the robustness of the design is estimated, e.g., the percentage of irregular electrical circuits, i.e., electrical circuits with unsatisfactory performance, likely to be manufactured.

A possible method is to simulate the effect of the variation of one parameter at a time (one-at-a-time, OAT) and calculate the performance of the electrical circuit for each variation; while being accurate, this method is computationally very expensive, usually not feasible for larger electrical circuits.

Another method is to generate variation samples, each of which comprises a multitude of different variations, i.e., usually randomly or pseudo-randomly varying a multitude of parameters of different components in the circuit as a testing sample; this is also referred to as Monte Carlo sampling or Monte Carlo method.

While being computationally substantially more efficient than the OAT method, the Monte Carlo method still requires a considerable amount of computational power which may be prohibitive specifically when, e.g., applied to larger electrical circuits having a huge number of components, where each Monte Carlo sample comes at a considerable computational cost, or to electrical circuits exhibiting rare events and requiring a huge number of Monte Carlo samples to be characterized.

Some concepts have been proposed to overcome the drawbacks of the Monte Carlo method. In U.S. Pat. No. 8,954,910 B1 and similarly in US 2013/0226544 A1, it is suggested to use a regression model or to apply an orthogonal matching pursuit (U.S. Pat. No. 8,954,910 B1) between the variation samples and the resulting variation in performance in order to identify components the parameter variations of which have the strongest influence on the performance of the electrical circuit. The Monte Carlo method for further analysis of the electrical circuit is then concentrated on variation samples with variations in the parameters of the thusly identified components, e.g., by ranking further variation samples (US 2013/0226544 A1).

It is an object of the invention to provide an even more efficient method for detecting, in an electrical circuit, those components the parameter variations of which have the strongest influence on a performance of the circuit, which method further allows for increased effectiveness of subsequent circuit analysis.

This and other objects are achieved by a computer-implemented method for detecting said components with the features of claim 1.

According to the invention, a computer-implemented method is provided for detecting, in a netlist representing an electrical circuit with electrical components M_(g) subject to variations δ of their model parameters x_(j), those components M_(g)* the model parameter variations δ of which have the strongest influence on a given performance metric y_(n) of the electrical circuit, which comprises the following steps:

First, receiving, by an Interface Unit, the netlist, and extracting a topology Q of the circuit, the model parameters x_(j) of all components M_(g) of the circuit, and the variations δ of all model parameters. For this, standard SPICE model libraries may be used.

Then, generating, by a Sampling Unit, preferably a Monte Carlo Simulation Unit, a multitude N of variation samples v_(n), each comprising a different set of candidate variations x′_(j) of the model parameters x_(j) around their standard value. Each sample v_(n) contains variations in a number of model parameters, such as the threshold voltage or the like, for each transistor in the circuit.

Then, calculating, by a Circuit Simulation Unit, preferably using a SPICE simulator, for each variation sample v_(n), the performance metric y_(n) of the circuit and a deviation from a predetermined standard performance metric of the circuit, the deviations for all variation samples v_(n) of the multitude forming a deviation vector y_(D). This deviation vector will be of the dimension 1×N.

Prior to the following regression analysis, the topology Q of the electric circuit is analyzed by a Topology Analyzing Unit and topological patterns P_(k) are determined. Such topological patterns in the circuit are formed by two or more electrically interconnected components M_(g), such as interconnected transistors in a current mirror. Known methods and program libraries can be applied to identify topological patterns, such as Kirchhoff's Circuit Analysis. The identified topological patterns P_(k) are then passed on to an Optimization Unit, which runs a numerical regression analysis, preferably an iterative orthogonal matching pursuit, on the variation samples and the deviation vector in order to detect M_(g)*. The topological patterns are used to improve the regression analysis by introducing additional dependencies between the candidate variations x′_(j), of the model parameters x_(j). The dependencies might be any kind of mathematical dependency, such as weighted addition or subtraction of the parameters x_(j) of the components which are part of the topological pattern. Typically, the kind of dependency between the model parameters x_(j) depends on the type of topological pattern and the performance to be simulated. The Topology Analyzing Unit might take the performance to be simulated into account, for example the total power consumption of the circuit, and determine the dependencies of the topological parameters based on that performance. The invention is based on the finding that the performance of the electrical circuit is often considerably influenced by topological patterns of components in the circuit. Such topological patterns are segments in the electrical circuit where the electrical components are specifically interconnected.

Examples of topological patterns are current mirrors, differential amplifiers, voltage dividers, voltage doublers, simple latches, oscillators, or any other circuit elements known in the area of analog and digital electronic circuit design.

According to the invention, these topological patterns are used to improve the numerical regression analysis. While in state of the art methods, such as described in U.S. Pat. No. 8,954 910 B1, the regression analysis is limited to the independent candidate variations x′_(j), of the chosen model parameters x_(j), the method according to the invention further takes dependencies of components into account which are interconnected in above mentioned patterns. As an example, if the Gate and Drain terminals of a transistor are coupled to the Gate of a second transistor and the Source terminals of both transistors are coupled to build a current mirror, a variation in parameters (such as local deviations in the processing parameters, for example body doping) of one transistor will most likely be connected with a similar variation in the other transistor. It has been found by the inventors that taking such topology-induced dependencies into account in the regression analysis significantly reduces the computational power necessary for detecting the most influential components of the circuit.

Here, the term “performance” might denote any electrical output characteristic of the circuit as determined by the circuit simulator. The performance might be, for example, a voltage, a current, a gain, an amplification factor in terms of current or voltage amplification, a power consumption, a cutoff frequency, a bandwidth, a phase shift, a time period deduced from a transient analysis, a transfer curve, a noise, or any other output of an electrical circuit simulator. It shall be understood that the method may be applied to more than one specific performance, in which case the components the model parameter variations of which have the strongest influence on the performance are detected separately for each performance.

The detected components and their model parameter variations can subsequently be used in more effectively redesigning the electrical circuit, when necessary, e.g., by concentration on the most influential electrical components in the circuit and their model parameter variations, and/or in more effectively analysing the electrical circuit subsequently, e.g., in circuit performance analysis, sensitivity analysis etc.

Any known method of regression modelling for estimating the relationships among variables and thereby identifying said components to be detected may be considered.

It is, however, advantageous when said regression model is an iterative orthogonal matching pursuit for said detecting of the components, i.e., the detecting of the components the model parameter variations of which have the strongest influence on the performance of the circuit. The iterative method of orthogonal matching pursuit generates regression coefficients substantially in the order of influence and can therefore be stopped whenever the model becomes sufficiently accurate, which makes the orthogonal matching pursuit computationally very effective.

In an embodiment of the invention, the method comprises the following steps: A Preconditioning Unit which is integrated with or connected to the Optimization Unit generates, for each topological pattern P_(k), at least one topological parameter t_(k) which depends on the model parameters x_(j) of the electrical components M_(g) interconnected in said topological pattern P_(k). Such dependency is based on the topological pattern and the performance to be investigated. The dependencies might be determined by from an internal or an external database containing a set of known topological patterns and their predetermined dependency with respect to a set of possible performance metrics, such as the circuit's power consumption. It might be, for example, that a topological parameter depends on the weighted model parameters of two, three, or more identified components in an additive or subtractive way. For example, the output current of a current mirror depends on the width of all transistors in the current mirror circuit. Thus, depending on the topological pattern, the topological parameter might be any mathematical relation of the model parameters of all components identified in the topological pattern.

The Preconditioning Unit then appends, to each variation sample v_(n), for each topological parameter t_(k), a candidate variation t′_(j) dependent on the candidate variations x′_(j), of the respective model parameters x_(j) of the electrical components interconnected in said topological pattern. For example, if a topological pattern was identified to depend on two components x₄ and x₇ in either an additive or subtractive manner, the candidate variation t′_(j) might contain the sum x₄′+x₇′ and the difference x₄′−x₇′ of the variations of these components.

The Preconditioning Unit then establishes, for each of the topological and model parameters t′_(j) and x′_(j), a variation vector w_(u) comprising all candidate variations t′_(j) and x′_(j), of all variation samples v_(n) of the multitude N. It then sets the deviation vector y_(D) as a starting-point for a residual vector r_(c) in the iterative orthogonal matching pursuit.

Further, the Optimization Unit, in each iteration step of the orthogonal matching pursuit: finds a variation vector w_(u) which best matches the residual vector r_(c) and adds said variation vector w_(u) to a first group E₁, and determines for each variation vector w_(u) of said first group E₁, a weight factor f_(c) such that the sum of all variation vectors w_(u) of the first group E₁, weighted with their respective weight factors f_(c), approximates the deviation vector y_(D). It then sets a remainder ρ of said approximation as the residual vector r_(c) for the next iteration step, until the remainder ρ falls below a predetermined first threshold TH₁; and identifies the components M_(g)* as members of the respective variation vectors w_(u) comprised in the first group E₁.

Generating topological parameters and including candidate variations of the topological parameters into each variation sample greatly enhances the efficiency of the method, as the topological or electrical parameters the variations of which have the strongest influence on the circuit's performance are readily determined and consequently the respective components are detected, e.g., by the respective weight factors. Moreover, the method is fully flexible, as topological parameter may be generated for any topological pattern. The orthogonal matching pursuit is computationally effective in approximating the deviation vector and thereby determining the weight factors. The first threshold can easily be predetermined by means of statistical methods as known in the art. When falling below said first threshold, the variation vectors in the first group immediately limit the number of components to be detected. As the variation vectors are established for each of the topological and model parameters separately and each topological and model parameter is directly related to one or more electrical components of the circuit, the components to be detected are identified by this unambiguous relation.

In an advantageous variant thereof, each topological parameter is generated according to:

$t_{k} = {\sum\limits_{j}^{J_{k}}{s_{jk}b_{jk}x_{jk}}}$ with: t_(k) being the topological parameter of the k^(th) topological pattern; J_(k) being a total number of model parameters the k^(th) topological pattern; X_(jk) being the j^(th) model parameter in the k^(th) topological pattern; and s_(jk), b_(jk) being respective size and bias coefficients of said j^(th) model parameter.

Topological parameters are thereby generated efficiently. Moreover, each topological parameter is normalized by its respective size and bias coefficients, such that the topological parameters have the same variance, i.e., the same relative influence on the performance of the circuit, as the model parameters.

A further embodiment of the method comprises the following steps:

The Preconditioning Unit which is integrated with or connected to the Optimization Unit establishes, for each of the model parameters x_(j), a variation vector w_(u) comprising all candidate variations x′_(j) of all variation samples v_(n) of the multitude N; and sets said deviation vector y_(D) as a starting-point for a residual vector r_(c) in said iterative orthogonal matching pursuit. The Optimization Unit, in each iteration step of the orthogonal matching pursuit: finds a predetermined number of variation vectors w_(u) which best match the residual vector r_(c), selects, for each best-matching variation vector w_(u) found, the topological pattern P_(k) in which that electrical component M_(g) is interconnected in, which has the model parameter x_(j) for which said variation vector w_(u) was established, and finds, from the selected topological patterns P_(k), that topological pattern P_(k) the variation vectors w_(u) of the model parameters x_(j) of the electrical components M_(g) interconnected therein collectively best match the residual vector r_(c), and adding said variation vectors w_(u) of the found topological pattern P_(k) to a second group E₂.

It then determines, for each variation vector w_(u) of said second group E₂, a weight factor f_(c) such that the sum of all variation vectors w_(u) of said second group E₂, weighted with their respective weight factors f_(c), approximates the deviation vector y_(D), and sets a remainder ρ of said approximation as the residual vector r_(c) for the next iteration step, until the remainder ρ falls below a predetermined second threshold TH₂. It then identifies the components M_(g)* as members of the variation vectors w_(u) comprised in the second group E₂.

This embodiment of the method is flexible in use and can even be retrofitted into an existing setting which uses an orthogonal matching pursuit but without considering topological patterns in the circuit. It is similarly efficient as said first embodiment of the present method and effectively identifies the components to be detected by the variation vectors in said second group which via the model parameters are unambiguously related to the respective electrical components.

In a further embodiment, said step of finding that topological pattern P_(k) the variation vectors w_(u) of which collectively best match the residual vector r_(c) is terminated when, for each of the selected topological patterns P_(k), a predetermined number of variation vectors w_(u) which best match the residual vector r_(c) have been found. By terminating said step when having found a predetermined number of, e.g., two, three, four or more variation vectors which best match the residual vector the method can be accelerated while only insignificantly affecting the accuracy. It is, however, particularly computationally efficient and still accurate, when said predetermined number of variation vectors which best match the residual vector is two.

Preferably, said determining the weight factor comprises a method of least squares. This is a reliable and proven method. For general applicability, it is particularly advantageous when each variation vector is normalized by its variance. Thereby, the matching of the variation vectors with the deviation vector and/or residual vector is independent of possible differences in the variance values of the variations of different topological and model parameters.

The topological patterns may be determined in multiple different ways. In a favourable variant, the topological patterns are determined using a program module or library which implements a netlist analysis based on Kirchhoff's circuit laws, i.e., Kirchhoff's current law (also: “nodal rule”) and Kirchhoff's voltage law (also: “loop rule”).

They are applied to the topology of the electrical circuit, e.g., represented by a netlist or a matrix derived therefrom, thereby identifying the interconnections of the electrical components in the electrical circuit and, therefrom, structures of potential significance in the circuit, i.e., the topological patterns.

In an alternative or additional variant, the topological patterns are preferably determined based on a similarity to one or more predetermined target patterns. Generally, such target patterns are predefined, which were previously identified as being prone to parameter variations having strong influence on the electrical circuits performance. This results in a very effective way of determining topological patterns of high relevance. In a particularly preferred embodiment thereof each target pattern includes two or more transistors with interconnected terminals. Topological patterns with electrical components of this type and interconnections are specifically prone to variations of the model parameters.

While the variation samples may be generated by means of a diversity of methods known in the art, it is preferred that said generating the variation samples comprises Monte Carlo sampling. Monte Carlo sampling is widely recognised for solving problems in the field of probability distribution.

In a further embodiment, the method comprises the steps of:

generating, by the Sampling Unit, a multitude of further variation samples v_(z);

estimating, by a Postprocessing Unit, for each further variation sample v_(z), a performance deviation Δy_(z) using the weight factors f_(c) of the variation vectors w_(u) by which said electrical components M_(g)* were identified;

ranking, by the Postprocessing Unit, said further variation samples v_(z) according to said estimated performance deviations Δy_(z);

calculating, by the Circuit Simulation Unit, a performance y_(z) of the circuit (1) for each further variation sample v_(z) in the sequence of the ranking;

comparing, by the Postprocessing Unit, the performance y_(z) of the circuit (1) with a predetermined model performance and incrementing an irregularity count IRC with each irregularity in the circuit's calculated performance y_(z) as compared to the model performance until either no irregularity occurs for a predetermined number of consecutive calculations or said irregularity count exceeds a predetermined third threshold TH₃; and outputting, by an Output Unit, the irregularity count (IRC).

Thereby, a particularly effective method for estimating a failure (or: irregularity) rate of the electrical circuit's design is achieved, which leads to an estimation on the expected waste during manufacturing of the electrical circuit.

The invention further relates to a computer-readable medium comprising computer-executable instructions causing an electronic device to perform the method according to the invention.

The invention further relates to an electronic device comprising a processing unit (such as a CPU), an electronic memory (such as a RAM or ROM), and a communication unit (such as a keyboard, a mouse, or a network interface), which is adapted to execute a method according to the invention. Such electronic device might be realized as a personal computer (PC) comprising an Interface Unit, a Sampling Unit, a Circuit Simulation Unit, an Optimization Unit, and a Topology Analyzing Unit which are adapted to perform the steps as described above. The electronic device might also comprise a Preconditioning Unit as well as a Postprocessing Unit and an Output Unit adapted to execute the steps described above. These units might be realized in electronic hardware or in software; in particular they might be realized as logic units or subroutines in the processing unit when executing a method according to the invention. The electronic device might also be part of a Client-Server environment, wherein certain units, such as the Sampling Unit and the Circuit Simulation Unit might be realized in the processing unit of the server computer, and other units, such as the Interface Unit and the Output Unit, might be realized in the CPU of a client computer. Further, the electronic device might be connected, via TCP/IP or other protocols, to a database on a server storing topological patterns, model parameters, relationships between specific performance metrics and the topological patterns, or other data.

The invention shall now be explained in more detail below on the basis of exemplary embodiments thereof with reference to the accompanying drawings, in which:

FIGS. 1a-1d show embodiments of the method of the invention in a schematic flow chart;

FIG. 2 shows an example for an electrical circuit with electrical components, the method of FIGS. 1a-1d is applied to, in a circuit diagram;

FIG. 3 shows the electrical circuit of FIG. 2 in a graph representation diagram;

FIG. 4 shows an embodiment of the method of FIG. 1d in a flow chart;

FIG. 5 shows another example for an electrical circuit with electrical components, the method of FIG. 1d is applied to, in a circuit diagram;

FIGS. 6a to 6j show a respective performance of the electrical circuit of FIG. 2 over variations in different parameters of the electrical components in respective scatterplot diagrams; and

FIGS. 7 and 8 show further embodiments of the method of FIG. 1d in respective flow charts.

Based on FIGS. 1a-1d and FIG. 2, a method shall be explained which is applied to an exemplary electrical low drop-out regulator circuit 1 shown in FIG. 2. The circuit 1 has two or more electrical components M₁, M₂, . . . , M_(G), generally M_(g), which are interconnected in the electrical circuit 1, wherein G is the total number of electrical components M_(g) in the circuit 1. The components M_(g) may be active, e.g., a current source M₁, a voltage source M₂, or a transistor M₈- M₁₆, or passive, e.g., a capacitor or inductor (not shown in FIG. 2), or a resistor M₁₇- M₂₀. As in the example of FIG. 2, each electrical component M_(g) (more precisely: its terminals C) is/are interconnected with (the terminals C of) other components M_(g) of the circuit 1 via connections L₁, L₂, . . . , generally L_(h). Where more than two components M_(g), i.e., more than two terminals C, are interconnected the respective connections L_(h) form nodes N₀, N₁, . . . , generally N_(j). For easier exemplification, some further nodes N_(i) are defined in connections L_(h) of only two interconnected components M_(g) in the example of FIG. 2, e.g., the nodes N₃ and N₅.

It shall be understood that the term “interconnected” does not mean that each electrical component M_(i) is connected to all other electrical components M_(i) in the electrical circuit 1. Furthermore, the electrical circuit 1 can be represented in different ways, e.g., by a circuit diagram like the one in FIG. 2, by a netlist, by a netlist matrix or the like, as will be shown in greater detail below. All of these representations include information on a topology Q of the electrical circuit 1, i.e., the composition and interconnection of the components Mg therein.

As shown in FIG. 2, several topology patterns such as P₁, P₂, and P₃ can be readily identified, which are based on predetermined patterns known from electronic circuit design. For example, Gate and Drain terminals of transistor M8 are coupled to Gate and Drain terminals of transistor M9, and the Source terminals of both transistors are connected to build a current mirror circuit, as known in the art of analog electronic circuits.

The electrical properties of each electrical component M_(g) are described by means of one or more model parameters x₁, x₂, . . . , x_(J), generally x_(j), wherein _(J) is the total number of model parameters x_(j) in the electrical circuit 1. The electrical components Mg are subject to variations δ₁, δ₂, . . . , δ_(J), generally δ, of their model parameters x_(j) modelling inaccuracies during manufacturing of the electrical circuit 1 and the components M_(g) therein. The variations δ of the component's model parameters x_(j) and their respective variation distributions are known to or defined by, e.g., an electrical circuit designer or can be estimated.

In step 2 of the method of FIG. 1d , the information on the circuit 1, i.e., the topology Q of the electrical circuit 1 and the model parameters x_(j) of all components M_(g) in the circuit 1, is provided by a netlist 101 which is received at interface unit 102, as shown in FIGS. 1a-1c . The netlist includes information on the model parameters xj and their variations δ.

In a subsequent step 3 topological patterns P₁, P₂, . . . , P_(K), generally P_(k), of two or more interconnected electrical components M_(g) are determined by a Topology Analyzing Unit 107 as shown in FIGS. 1a-1c , wherein K is the number of topological patterns P_(k) determined in the circuit 1. Details on determining topological patterns P_(k) will be explicated in greater detail below in reference to FIGS. 2 and 3. In the embodiment shown in FIG. 1b , the topological patterns are determined by comparison with target patterns provided by the Interface Unit. Such target patterns might be received from an external circuit pattern database, for example from a server running an Electronic Design Automation Platform.

A multitude N of variation samples v₁, v₂, . . . , V_(N), generally v_(n), is generated in a step 4 by a Sampling Unit 103, for example a Monte Carlo Simulation Unit 104, as shown in FIGS. 1a-1c . Each variation sample v_(n) comprises a different set of candidate variations x′₁, x′₂, . . . , x′_(J), generally x′_(j), of the parameters x_(j). The candidate variations x′_(j), are produced in a random or pseudo-random way, e.g., by means of Monte Carlo sampling or other methods known to the skilled person. When arranging in form of a variation matrix VM for visualisation purpose, the variation samples v_(n) can be understood as rows in the variation matrix VM, each column of which comprises the candidate variations x′_(j) of one of the parameters x_(j), according to:

$\begin{matrix} {{VM} = \begin{bmatrix} x_{11}^{\prime} & \ldots & x_{1j}^{\prime} & \ldots & x_{1J}^{\prime} \\ \vdots & \ddots & \vdots & \; & \vdots \\ x_{n\; 1}^{\prime} & \ldots & x_{nj}^{\prime} & \ldots & x_{nJ}^{\prime} \\ \vdots & \; & \vdots & \ddots & \vdots \\ x_{N\; 1}^{\prime} & \ldots & x_{Nj}^{\prime} & \ldots & x_{NJ}^{\prime} \end{bmatrix}} & \left( {{eq}.\mspace{14mu} 1} \right) \end{matrix}$ wherein x′_(nj), denotes the parameter's x_(j) candidate variation x′_(j) of the n-th variation sample v_(n).

It shall be noted that, between consecutive steps in the flow chart of FIG. 1d (and those of FIGS. 4 and 7, likewise), some, usually newly created, information passed from one step to the next one is explicitly noted in the respective drawings for easier reference. However, all information, e.g., on components M_(g), their parameters x_(j), and candidate variations x′_(j), is understood to be available throughout all steps of the method without explicit reference in the drawings.

In a subsequent step 5, a performance y₁, y₂, . . . , y_(N), generally y_(n), of the electrical circuit 1 is calculated by a Circuit Simulation Unit 105 as shown in FIGS. 1a-1c ; the performance being a gain, a power consumption, a bandwidth, or another characteristic of the circuit. By nature, the performance y_(n) is influenced by the variations δ (here: the candidate variations x′_(j)) of the component's M_(i) model parameters x_(j). This is why a separate performance y_(n) of the circuit 1 is calculated for each variation sample v_(n) of the multitude N.

Said calculation of the performance y_(n) is based on the model parameters x_(j) of the components M_(g) and their interconnection in the circuit 1, and executed by solving both component and circuit equations derived therefrom. Usually a circuit simulator, like “SPICE”, is employed for calculating (or simulating) the performance y_(n) of the circuit 1, as known to the skilled person.

Furthermore, by the Circuit Simulation Unit 105, a deviation vector y_(D) is formed by determining the deviation of the performance y_(n) calculated for each variation sample v_(n) from a standard performance y₀ of the electrical circuit 1 according to:

$\begin{matrix} {y_{D} = {\begin{bmatrix} y_{1} \\ \vdots \\ y_{n} \\ \vdots \\ y_{N} \end{bmatrix} - y_{0}}} & \left( {{eq}.\mspace{14mu} 2} \right) \end{matrix}$

The standard performance y₀ may either be determined as the performance of the electrical circuit 1 without any variations δ in the parameters x_(j) or as an average value of the calculated performance y_(n) according to y₀=(y₁+ . . . +y_(N))/N.

As depicted by the two parallel branches in FIGS. 1a-1d , the execution of step 3 and the execution of steps 4 and 5 are independent from each other.

In subsequent step 6, the variation samples v_(n), the calculated deviation vector y_(D), and the topological patterns P_(k) are used in a regression model by an Optimization Unit 106 as shown in FIGS. 1a-1c which can estimate the relationships among variables as known in the art, e.g. in an orthogonal matching pursuit. An orthogonal matching pursuit is an iterative approximation method, details of which will be explicated below with respect to FIGS. 4 and 7. Thereby, those electrical components M_(g)* of the circuit 1 are detected, the model parameters x_(j) of which have the strongest influence on the performance y_(n) of the circuit 1. As each candidate variation x′_(j) is directly related to the respective parameter x_(j) and each parameter x_(j) is directly related to the respective electrical component M_(g), each candidate variation x′_(j) unambiguously identifies a respective electrical component M_(g).

Based on the exemplary circuit 1 of FIGS. 2 and 3, it shall now be exemplified how to determine a topological pattern P_(k) in the circuit 1 according to step 3.

As previously mentioned, the topology of the electrical circuit 1 may be given, e.g., by a netlist which contains the information regarding the topological properties of the circuit 1 corresponding to the connections L_(h) between the components M_(g) including the nodes N_(i). In the netlist, each component's M_(g) terminal C is identified with a unique node N_(i) and every node N_(i) is identified by one or more component's terminals C.

In general, a topological pattern P_(k) is determined by means of Kirchhoff's circuit laws, i.e., by applying Kirchhoff's voltage law (KVL) to find KVL patterns or Kirchhoff's current law (KCL) to find KCL patterns or any combination of different KVLs (or KCLs) on the electrical circuit 1, such that more than one individual component M_(g) with one or more model parameters x_(j) which are subject to variations δ are included. Therefore, any loop or cut-set finder algorithm used in graph theory may be used to find KVL patterns and KCL patterns and determine, therefrom, topological patterns P_(k). Alternatively or in addition, the topological patterns P_(k) may be determined by checking the electrical circuit 1 or segments thereof for similarity to one or more predetermined target patterns, e.g., two or more transistors M_(g) with interconnected terminals.

As an example, a netlist matrix A (eq. 3) representing the exemplary electrical circuit 1 in FIG. 2 may be created from the netlist (or the circuit diagram 1). In the thusly created netlist matrix A, the components M_(g) correspond to the columns (from left to right: M₈, M₉, M₁₀, M₁₁, M₁₂, M₁₃, M₁₄, M₁₅, M₁₆, M₁, M₂, M₁₉, M₂₀, M₁₇, M₁₈) and the different nodes Ni correspond to the rows (from top to bottom: N₀ to N₁₁).

                                        (eq.  3) $A = \begin{bmatrix} S & S & S & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 & {- 1} & 0 & 0 \\ {GD} & G & G & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & G & 0 & 0 & 0 & 0 & 0 & 0 & {+ 1} & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & S & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {+ 1} & 0 \\ 0 & D & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & {+ 1} \\ 0 & 0 & 0 & 0 & S & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} \\ 0 & 0 & 0 & D & 0 & {GD} & G & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & D & 0 & D & G & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & D & 0 & 0 & 0 & 0 & D & G & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & D & 0 & 0 & {+ 1} & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & G & 0 & 0 & 0 & 0 & 0 & 0 & {- 1} & {+ 1} & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & S & S & S & S & {+ 1} & 0 & 0 & 0 & 0 & 0 \end{bmatrix}$

In eq. 3 zero values in the matrix are depicted as “o” for better visibility of the non-zero values, “S” denotes a connection to a source terminal C of a transistor (component) M_(g) in the circuit 1, likewise, “G” and “D” denote connections to a gate or drain terminal C, respectively, and “−1” and “+1” denote a sign of a voltage or current at the respective terminal C. Using this information, the topological patterns P_(k) can be determined.

When, for example, considering distributions of the variations δ of model parameters x_(j) of transistor components M_(g), a topological pattern P_(k) has to include at least two transistors. In the following, possible ways to obtain the topological patterns P_(k) are explicated.

To obtain KCL patterns, first KCLs at all nodes N, are considered (nodal KCLs). Then combinatorial KCLs are optionally formed by combining the nodal KCLs with common components M_(g). Afterwards, a further optional combining iteration is performed on the previously obtained combinatorial KCLs by combining the combinatorial KCLs with common nodes N_(i), and these iterations are continued until a stop condition is met. A possible stop condition when determining the topological patterns P_(k) is to have no common nodes N_(i) between the obtained combinatorial KCLs left, or, when said determination is based on a least squares method, to have the number of components Mg with varying parameters x_(j) in the combinatorial KCLs equalling or exceeding the number of variation samples v_(n).

Accordingly, for the electrical circuit 1 of FIG. 2, the KCL patterns may be found based on the following (with a current I_(Mg) denoting the electrical current flowing through the respective component M_(g) in the circuit 1 of the example of FIG. 2):

(i) Nodal KCLs:

N₀: KCL is not meaningful

N₁: corresponding to I_(M8)−I_(M1)=0

N₂: corresponding to I_(M2)=0

N₃: corresponding to I_(M11)−I_(M17)=0

N₄: corresponding to I_(M17)−I_(M18)−I_(M9)=0

N₅: corresponding to I_(M18)+I_(M12)=0

N₆: corresponding to I_(M13)−I_(M11)=0

N₇: corresponding to I_(M14)−I_(M12)=0

N₈: corresponding to I_(M15)−I_(M10)=0

N₉: corresponding to I_(M16)−I_(M19)=0

N₁₀: corresponding to I_(M19)−I_(M20)=0

N₁₁: KCL is not meaningful

(ii) Combinatorial KCLs—The First Combining Iteration Based on Common Components M_(g):

N₃ and N₄: corresponding to I_(M11)−I_(M18)−I_(M9)=0

N₃ and N₆: corresponding to I_(M13)−I_(M17)=0

N₄ and N₅: corresponding to I_(M17)−I_(M9)+I_(M12)=0

N₅ and N₇: corresponding to I_(M18)+I_(M14)=0

N₉ and N₁₀: corresponding to I_(M16)−I_(M20)=0

(iii) Combinatorial KCLs—Second Combining Iteration Based on Common Nodes N_(i):

N₃, N₄ and N₆: corresponding to I_(M13)−I_(M18)−I_(M9)=0

N₃, N₄ and N₅: corresponding to I_(M11)−I_(M9)+I_(M12)=0

N₄, N₅ and N₇: corresponding to I_(M17)−I_(M9)+I_(M14)=0

(iv) Combinatorial KCLs—Third Combining Iteration again Based on Common Nodes N_(i):

N₃, N₄, N₅, N₆, and N₇: corresponding to I_(M13)+I_(M14)−I_(M9)=0

It should be noted that the KCLs on the nodes N₀ and N₁₁ are not considered as meaningful. Furthermore, the current through the gates of the transistors M_(g) are supposed to be zero. This may not be a general rule, however, it could be considered as a fair approximation as usually variations δ affect the biasing and can be explained as small direct current (DC) signal effects.

From the above-mentioned twenty-one KCLs, only nine KCLs include more than one component M_(g) which have, in this example, varying parameters x_(j) and therefore the number of all possible topological patterns P_(k) obtained by means of KCL is limited to nine: (M₁₁, M₁₃), (M₁₂, M₁₄), (M₁₀, M₁₅), (M₁₁, M₉), (M₉, M₁₂), (M₉, M₁₃), (M₁₁, M₉, M₁₂), (M₉, M₁₄), and (M₉, M₁₃, M₁₄)

In order to obtain KVL patterns, the ideal voltage and current sources are replaced with short and open circuits, respectively, and the electrical circuit 1 (here: the netlist matrix A of eq. 2) is explored to find loops including more than one gate-source (GS) of transistor components M_(g). Thereby, we obtain the KVL patterns (with a voltage V_(Gsg) denoting a gate-source voltage at the respective transistor Mg and a voltage V_(Mg) denoting a voltage at the respective general component M_(g) in the circuit 1 of the example of FIG. 2) as:

(M₈, M₉): corresponding to V_(GS8)−V_(GS9)=0

(M₈, M₁₀): corresponding to V_(GS8)−V_(GS10)=0

(M₉, M₁₀): corresponding to V_(GS9)−V_(GS10)=0

(M₁₃, M₁₄): corresponding to V_(GS13)−V_(GS14)=0

(M₁₁, M₁₂): corresponding to −V_(M2)+V_(GS11)+V_(M17)+V_(M18)−V_(GS12)+V_(M20)=0

It shall be noted that, for example, −V_(CC)+V_(GS13)+V_(DS11)+V_(M17)+V_(DS)9=0 (with a voltage V_(Dsg) denoting a drain-source voltage at the respective transistor M_(g)), while being a meaningful KVL, is not considered as a KVL pattern in the present case as it does not include two or more gate-source voltages but merely two drain-source (DS) voltages.

Now, as all KCL and KVL patterns have been obtained, these patterns may be combined to avoid redundancy or to obtain more comprehensive and effective topological patterns P_(k). This may be performed, e.g., by forming a graph 7 (FIG. 3) in which nodes GN₈, GN₉, . . . , generally GN, correspond to all components M_(g), which form the KCL and KVL patterns, and in which edges GE₁, GE₂, . . . , generally GE, between two nodes GN indicate that the respective nodes GN belong to the same KCL or KVL pattern.

In the present example, the graph 7 is obtained from the KCL and KVL patterns. This graph shows all KCL and KVL pattern based relationships between the components M_(g) with varying parameters x_(j). It may, alternatively, be obtained directly from the netlist matrix A by exploring all columns and extracting meaningful KCLs and KVLs, which include columns that correspond to a component M_(g) with one or more varying parameters x_(j). In this very case, the corresponding edges GE may be added to the graph 7 of FIG. 3.

Topological patterns P_(k) which are even more comprehensive than the KCL and KVL patterns are, e.g., determined based on a similarity to one or more predetermined target patterns, which may be more or less extensive, or by means of a loop finder algorithm with appropriate constraints, as known to the skilled person.

In the optional embodiments of FIG. 4 and FIG. 1b , step 6 of the present method comprises the following steps.

In step 8 subsequent to steps 3 and 5 (FIG. 1d ), at least one topological parameter t_(k) is generated for each topological pattern P_(k). Each topological parameter t_(k) is composed of the model parameters x_(j) of the components M_(g) interconnected in the respective topological pattern P_(k), as will be exemplified in greater detail below. As a consequence of the model parameters x_(j) being subject to variations δ, the topological parameters t_(k) are likewise subject to variations.

Hence, in subsequent step 9 a candidate variation t′_(k) is calculated for each topological parameter t_(k) and for each variation sample v_(n), from all variations δ of the model parameters x_(j) of the components M_(g) interconnected in the respective topological pattern P_(k). The candidate variations t′_(k) of the topological parameters t_(k) are then included into the respective variation sample v_(n), for which they were calculated. The variation matrix VM of eq. 1 (set up for visualisation purpose) can thereby be expanded according to:

$\begin{matrix} {{VM} = \begin{bmatrix} x_{11}^{\prime} & \ldots & x_{1j}^{\prime} & \ldots & x_{1J}^{\prime} & t_{11}^{\prime} & \ldots & t_{1k}^{\prime} & \ldots & t_{1K}^{\prime} \\ \vdots & \ddots & \vdots & \; & \vdots & \vdots & \ddots & \vdots & \; & \vdots \\ x_{n\; 1}^{\prime} & \ldots & x_{nj}^{\prime} & \ldots & x_{nJ}^{\prime} & t_{n\; 1}^{\prime} & \ldots & t_{nk}^{\prime} & \ldots & t_{nK}^{\prime} \\ \vdots & \; & \vdots & \ddots & \vdots & \vdots & \; & \vdots & \ddots & \vdots \\ x_{N\; 1}^{\prime} & \ldots & x_{Nj}^{\prime} & \ldots & x_{NJ}^{\prime} & t_{N\; 1}^{\prime} & \ldots & t_{Nk}^{\prime} & \ldots & t_{NK}^{\prime} \end{bmatrix}} & \left( {{eq}.\mspace{14mu} 4} \right) \end{matrix}$

In subsequent step 10, a variation vector w₁, w₂, .., w_(u), generally w_(u), (with U=J+K) is established for each of the topological and model parameters t_(k), x_(j). Each variation vector w_(u) comprises all candidate variations t′_(k), x′_(j), of one of the topological and model parameters t_(k), x_(j), i.e., all the topological or model parameter's candidate variations t′_(k), x′, of all variation samples v_(n), of the multitude N. Hence, in the variation matrix VM of eq. 4 the variation vectors w_(u) form the columns. Optionally, each variation vector w_(u) is normalized by its variance.

Next, in step 11 said deviation vector y_(D) generated in step 5 (FIG. 1d ) is set as a starting-point, i.e., initial value or vector, for a residual vector r_(c) in said iterative orthogonal matching pursuit, wherein the iteration counter c is set to its starting value. In each iteration step of the orthogonal matching pursuit the following sub-steps are performed:

In sub-step 12, from the variation vectors w_(u) that variation vector w_(u) is searched and found which best matches the residual vector r_(c), i.e., is most similar thereto. This can be achieved, e.g., by a correlation of each variation vector w_(u) and the residual vector r_(c) and comparing the resulting correlation coefficients, or by a dot product of each variation vector w_(u) and the residual vector r_(c). Said best matching variation vector w_(u) is added to a first group E₁.

In sub-step 13, a weight factor f_(c) is determined for each variation vector w_(u) of said first group E₁, e.g., by means of a method of least squares, such that the sum of all variation vectors w_(u) of the first group E₁ when weighted with their respective weight factor f_(c) approximates the deviation vector y_(D). Hence, after two or more iterations of the orthogonal matching pursuit, a corresponding number of two or more variation vectors w_(u) are in the first group E₁, and a respective weight factor f_(c) is determined for each variation vector w_(u) anew in each iteration such that the deviation vector y_(D) is best approximated.

In a decision sub-step 14, it is investigated whether a remainder ρ of this approximation, i.e., the difference between the approximation and the deviation vector y_(D), has fallen below a predetermined first threshold TH₁; when this is not the case (branch “n” in FIG. 4), i.e., the remainder ρ is still too large, the iterative orthogonal matching pursuit is continued by setting, in sub-step 15, said remainder ρ as the new residual vector r_(c) for the next iteration step, incrementing the counter c and returning to sub-step 12.

When, on the other hand, the remainder ρ has fallen below said threshold TH₁ (branch “y” in FIG. 4), the orthogonal matching pursuit is completed in step 16 and the electrical components M_(g)* to be detected are identified by means of the respective variation vectors w_(u) comprised in said first group E1. When desired, the detected electrical components M_(g)* may optionally be ranked, e.g., based on the respective weight factor f_(c) determined for each variation vector w_(u) in the first group E₁ during the final iteration step.

This identification is unambiguous as mentioned earlier: Each candidate variation x′_(j), and, likewise, each variation vector w_(u) is directly related to a respective topological and/or model parameter t_(k), x_(j), each topological parameter t_(k) being directly related to the respective model parameters x_(j) of the components M_(g) in the corresponding topological pattern P_(k), and each model parameter x_(j) is directly related to an electrical component M_(g); consequently the electrical components M_(g) are unambiguously identified by the variation vectors w_(u) comprised in the first group E₁.

Said threshold TH₁ is predetermined based on statistical rules known to the skilled person.

It shall be noted that the iteration may optionally be terminated when the number of iterations equals said multitude N of variation samples v_(n).

Based on the exemplary current mirror circuit 1 of FIG. 5 and the FIGS. 6a to 6j , some variants on how to generate the topological parameters t_(k) shall now be explicated.

The electrical circuit 1 according to the example of FIG. 5 comprises three transistors M₅, M₆, and M₇ which pair-wise, i.e., M₅ and M₆ on the one hand and M₅ and M₇ on the other, form a first and a second current mirror 17, 18, respectively, wherein transistors M₅, M₆, M₇ shall have different sizes, i.e., different gate-length (here: “GL” and/or gate-width (here: “GW”). The first current mirror 17 (corresponding to the transistors M₅ and M₆) copies a current proportional (ideally equal) to a current I_(M3) of current source M₃ times the ratios of the respective gate-lengths and gate-widths according to I_(M3)×(GW_(M6)/GL_(M6))/(GW_(M5)/GL_(M5)) at the drain of the transistor M₆, wherein GW_(Mg) and GL_(Mg) denote the gate-width and gate-length of the respective electrical component M_(g). Likewise, the second current mirror 18 (corresponding to the transistors M₅ and M₇) copies a current proportional (ideally equal) to I_(M3)×(GW_(M7)/GL_(M7))/(GW_(M5)/GL_(M5)) at the drain of the transistor M₇.

In this example, gate-lengths GL_(M5), GL_(M6), GL_(M7) of the transistors M₅, M₆, M₇ shall be equal (GL_(M5)=GL_(M6)=GL_(M7)) which is usual, while the gate-widths GW_(M5), GW_(M6), GW_(M7) shall differ according to GW_(M5)=3×GW_(M6)=2×GW_(M7). Therefore, the currents at the drains of the transistors M₆ and M₇ are proportional (ideally equal) to I_(M3)/3 and I_(M3)/2, respectively.

In the electrical circuit 1 of FIG. 5 where the gates and sources of three transistors M₅, M₆, M₇ are connected in parallel, the topological information corresponds to three possible KVLs and the topological parameters t_(k) may be defined as all possible pair-wise combinations of model parameters x₅, x₆, x₇ of the transistors M₅, M₆, M₇ given by x₅±x₆, x₅±x₇ and x₆±x₇, accordingly. However, the sizes of transistors M₅, M₆, M₇ are different in this example (i.e., GW_(M5)≠GW_(M6)≠GW_(M7)) and the contribution of a varying parameter x_(j) is a function of the component's size. Thus, the topological parameters t_(k) may optionally be modified, i.e., normalized, by defining a corresponding size-coefficient s_(j) for each varying parameter x_(j) as s_(j)=1/√{square root over (GA)} where GA denotes the component's area, i.e., GA=GW×GL. It is important to note that the size-coefficient s_(j) depends on the technology of the respective component M_(g) and the distribution of its variation δ.

In the 0.35 μm technology used in this example, the model parameters' variations x_(j) are drawn from normal distributions with zero mean values and a given variance. However, in other circumstances the effect of variations x_(j) may depend on the component's area and result in performance variations characterized by a variance inversely proportional to the component's area (GA=GW×GL), where GA₅=GW_(M5)×GL_(M5), GA₆=GW_(M6)×GL_(M6), and GA₇=GW_(M7)×GL_(M7). When, for example, two transistors M_(g) are topologically connected (e.g. contributing to the same KVL) and both have the same size, similar contributions by their corresponding varying parameters x_(j) to the performance y_(n) of the circuit 1 are expected. However, when one of the transistors M_(g) has a larger area, a smaller contribution by the model parameters x_(j) of this transistor M_(g) is expected when compared to that of a transistor M_(g) with a smaller area. This is why said optional size-coefficient s_(j) is defined to obtain the topological parameter t_(k) accurately and take the relative contributions into account.

It shall be understood that different biasing conditions may also affect the relative contributions, such that for each transistor M₅, M₆, M₇ a further coefficient (the bias-coefficient) ID, may optionally be used which, however, usually has a smaller effect as compared to the effect of having different size of transistors M_(g).

Moreover, more than one model parameter x_(j) may—or usually will—be defined and taken into account per component M_(g), e.g., when the component M_(g) is a transistor. In this regard, it shall be noted, that the parameters x_(j) are generally based on physical values and may, e.g., correspond to a threshold voltage and/or a current factor etc., respectively.

In the example of FIGS. 5 and 6 for taking the geometry of the components M_(g) into account, the size-coefficients s_(j) are used to generate the topological parameters t_(k) as x₅/√{square root over (GA₅)}±x₆/√{square root over (GA₆)}, x₅/√{square root over (GA₅)}±x₇/√{square root over (GA₇)} and x₆/√{square root over (GA₆)}±x₇/√{square root over (GA₇)}. With the sizes of the present example (GL_(M5)=GL_(M6)=GL_(M7), GW_(L5)=3×GW_(L6)=2×GW_(L7)), the topological parameters t_(k) can be simplified to (X₅±√{square root over (3)}x₆)/2, (x₅±√{square root over (2)}x₇)/√{square root over (3)} and (√{square root over (3)}x₆±√{square root over (2)}x₇)/√{square root over (5)}. The thusly created topological parameters t_(k) have the same variance, i.e., the same relative influence on the performance yn of the circuit 1, as the model parameters x_(j).

The performance y_(n) of the electrical circuit 1 of FIG. 5 is calculated from the electrical current I_(M4) through the resistor (component) M₄, which ideally is equal to 5×I_(M3)/6. The respective results of the calculation of the circuit's performance y_(n) (here: I_(M4)/I_(M3)) using a Monte Carlo simulation (based on 0.35 μm CMOS technology) of the distributions of variations δ of the topological and model parameters t_(k), x_(j) are plotted in the scatterplot diagrams of FIGS. 6a to 6j for visualisation purpose. FIGS. 6d to 6i demonstrate that some of the topological parameters t_(k)—specifically: (x₅−√{square root over (3)}x₆)/2, (x₅−√{square root over (2)}x₇)/√{square root over (3)} and (√{square root over (3)}x₆+√{square root over (2)}x₇)/√{square root over (5)} having all calculation results distributed around a diagonal in the respective scatterplot diagrams of FIGS. 6d, 6e, and 6i —capture more clear and measurable dependencies as compared to, e.g., the model parameters x₅, x₆, and x₇, solely, the respective scatterplots of which show rather random distribution in FIGS. 6a to 6 c.

In fact, by testing all (KVL-based) pair-wise combinations to find topological patterns P_(k) and to generate topological parameters t_(k) therefor, it is found that the combinations (x₅ and x₆) and (x₅ and x₇) inversely contribute to the performance y_(n) while the combination (x₆ and x₇) contribute to the performance y_(n) in a similar manner. Consequently a combination of KVLs to form a topological pattern P_(k) with all three components M₅, M₆, M₇ and, thus, a three-component topological parameter t_(k) shall be considered in the present example based on the gate-source voltages V_(GSg) of the respective components M_(g) as V_(GS5)−V_(GS6)=0 and V_(GS5)−V_(GS7)=0, hence 2×V_(GS5) (V_(GS6)+V_(GS7))=0.

Therefrom, a topological parameter t_(k) is derived according to 2x₅−x₆ −x₇, which is then (optionally) simplified and normalized by means of the size-coefficients s_(j) into 2x₅/√{square root over (GA₅)}−x₆/√{square root over (GA₆)}−x₇/√{square root over (GA₇)} and further to (2x₅−√{square root over (3)}x₆−√{square root over (2)}x₇)/3. FIG. 6j shows a scatterplot of a topological parameter t_(k) according to this definition. Therein, the dependency, i.e., the influence on the performance y_(n), is immediately obvious due to the almost ideally linear distribution of the calculation results.

The scatterplots of FIGS. 6a to 6i , and even more the one of FIG. 6j , visualise that the use of topological parameters t_(k) generated for topological patterns P_(k) of two or more electrical components M_(g) in the circuit 1 effectively captures the dependencies between the performance y_(n), of the electrical circuit 1 and the model parameter variation vectors w_(u).

When, on the other hand, also the optional bias-coefficient b_(j) shall be taken into account, each topological parameter t_(k) is generated according to

$\begin{matrix} {t_{k} = {\sum\limits_{j}^{J_{k}}{s_{jk}b_{jk}x_{jk}}}} & \left( {{eq}.\mspace{14mu} 5} \right) \end{matrix}$ with: t_(k) being the topological parameter t_(k) of the k^(th) topological pattern P_(k); J_(k) being a total number of model parameters x_(j) in the k^(th) topological pattern P_(k); x_(jk) being the j^(th) model parameter in the k^(th) topological pattern; and s_(jk), b_(jk) being respective size and bias coefficients of said j^(th) model parameter x_(j).

It shall be understood that the investigation of all possible combinations of parameters x_(j) and their variation vectors w_(u) may be inefficient or even impossible, as for example when a circuit 1 has 10⁴ varying parameters x_(j), the number of all possible dual and triple combinations is around 10⁴×10⁴=10⁸ and 10⁴×10⁴×10⁴=10¹², respectively. However, when topological patterns P_(k) are taken into account, the total number of such combinations is limited and proportional to 10⁴, e.g., AN×10⁴, with AN being an integer indicating the average number of components M_(g) with varying parameters x_(j) which are interconnected to a single component M_(g) with varying parameters x_(j) in the topological pattern P_(k).

In the optional embodiment of FIG. 7 and FIG. 1 c, which is alternative to the embodiment of FIG. 4 and FIG. 1b , step 6 of the present method as shown in FIG. 1d , comprises the following steps.

In step 19, a variation vector w_(u) is established for each of the model parameters x_(j). The variation vector w_(u) comprises, for each of the model parameters x_(j), all candidate variations x′_(j), of all variation samples v_(n) of the multitude _(N). Optionally, each variation vector w_(u) is normalized by its variance.

Next, in step 20 said deviation vector y_(D) generated in step 5 (FIG. 1d ) is set as a starting-point for the residual vector r_(c) in said iterative orthogonal matching pursuit, and the iteration counter c is set to its starting value.

In each iteration step of the orthogonal matching pursuit the following sub-steps are performed:

In sub-step 21, from the established variation vectors w_(u) a predetermined number of variation vectors w_(u) is searched and found which best match the residual vector r_(c). This can be achieved, e.g., by a correlation or a dot product as has been explained in more detail above with respect to FIG. 4. Said predetermined number is higher than one. Each best-matching variation vector w_(u) was established, in step 19, for a model parameter x_(j) of an electrical component M_(g) which is interconnected in one of the topological patterns P_(k). In sub-step 22, the respective topological pattern P_(k) is selected for each of said best-matching variation vectors w_(u) found in sub-step 21. It is understood that at least some of the electrical components M_(g) may optionally be interconnected in two (or even more) neighbouring topological patterns P_(k), in which case two (or more) respective topological patterns P_(k) will be selected in sub-step 22 for each of said best-matching variation vectors w_(u) found in sub-step 21.

Thereafter, in sub-step 23, that topological pattern P_(k) is found from said selected topological patterns P_(k) the related variation vectors w_(u) of which, i.e., the variation vectors w_(u) of the model parameters x_(j) of the electrical components M_(g) interconnected therein, collectively best match the residual vector r_(c). This collective matching can be achieved, e.g., by means of a method of least squares as described below.

Said finding in sub-step 23 may optionally be terminated when, for each of the selected topological patterns P_(k), two or three (or, if desired, another predetermined number of) variation vectors w_(u) which collectively best match the residual vector r_(c) have been found.

Furthermore, in sub-step 23 said variation vectors w_(u) of the found topological pattern P_(k) which collectively best match the residual vector r_(c) are added to a second group E₂. In subsequent sub-step 24, for each variation vector w_(u) of said second group E₂, a weight factor fc is determined, e.g., by means of a method of least squares, such that the sum of all variation vectors w_(u) of said second group E₂, when weighted with their respective weight factors f_(c), approximates the deviation vector y_(D). Hence, after two or more iterations of the orthogonal matching pursuit, a corresponding number of at least two or more variation vectors w_(u) are in the second group E₂ and a respective weight factor f_(c) is determined for each variation vectors w_(u) anew in each iteration such that the deviation vector y_(D) is best approximated.

It shall be mentioned, that said sub-steps 23 and 24 may optionally be merged in that, for each of said selected topological patterns P_(k), the related variation vectors w_(u) are combined with the variation vectors w_(u) which have already been added to said second group E₂. In this case, respective weight factors f_(c) for each variation vector w_(u) are separately determined for each of said combinations of variation vectors w_(u) of a selected topological pattern P_(k) and variation vectors w_(u) in the second group E₂; consequently, the combination which best approximates the deviation vector y_(D) forms the second group E₂ for the next iteration, i.e., the variation vectors w_(u) of the selected topological patterns P_(k) which, together with the variation vectors w_(u) already added to said group E₂, result in the best approximation of the deviation vector y_(D) are added to said second group E₂.

In a subsequent decision sub-step 25, it is investigated whether a remainder ρ of this approximation, i.e., the difference between the approximation and the deviation vector y_(D), has fallen below a predetermined second threshold TH₂; when this is not the case (branch “n” in FIG. 7), i.e., the remainder ρ is still too large, the iterative orthogonal matching pursuit is continued by setting, in sub-step 26, said remainder ρ as the new residual vector r_(c) for the next iteration step and incrementing the counter c and by returning to sub-step 21.

When, on the other hand, the remainder ρ has fallen below said threshold TH₂ (branch “y” in FIG. 7), the orthogonal matching pursuit is completed in step 27 and the electrical components M_(g)* to be detected are identified by means of the variation vectors w_(u) comprised in said second group E₂. When desired, the detected electrical components M_(g)* may optionally be ranked, e.g., based on the respective weight factor f, determined for each variation vector w_(u) in the second group E₂ during the final iteration step.

This identification is unambiguous as mentioned above: Each candidate variation x′_(j) is directly related to respective variation vectors w_(u) in the corresponding topological pattern P_(k); the variation vectors w_(u), in turn, are related to model parameters x_(j) and each model parameter x_(j) is directly related to an electrical component M_(g); and consequently the electrical components M_(g) are unambiguously identified by the variation vectors w_(u) comprised in the second group E₂.

Said second threshold TH₂ is predetermined based on statistical rules known to the skilled person.

It shall be noted that the iteration may optionally be terminated when the number of iterations equals said multitude N of variation samples v_(n).

In the example of the optional embodiment of FIG. 8 of the present method, further steps are appended to the steps described above in respect to FIGS. 1, 4 and 7.

In step 28 which succeeds step 6 (or the respective steps 16 or 27 in the embodiments of FIGS. 4 and 7), a multitude Z of further variation samples v_(N+1), v_(N+2), . . . V_(N+Z), generally v_(z), is generated, e.g., by means of Monte Carlo sampling.

In subsequent step 29, a performance deviation Δy_(z) is estimated for each of said further variation samples v_(z). The performance deviations Δy_(z) are estimated on the basis of the weight factors fc, determined in steps 13 and 24, respectively, for each variation vector w_(u) by means of which said electrical components M_(g)* to be detected were identified. The performance deviation Δy_(z) is estimated to be higher the more a further variation sample v_(z) resembles a variation vectors w_(u) for which a weight factor f_(c) of higher value was determined.

In subsequent step 30, said further variation samples v_(z) are ranked according to said estimated performance deviations Δy_(z). The ranking means that further variation samples v_(z) with larger estimated performance deviations Δy_(z) are ranked higher.

In subsequent step 31 an iteration starts, where the performance y_(z) of the electrical circuit 1 is calculated for each further variation sample v_(z), i.e., for one variation sample v_(z) in each iteration, e.g., using SPICE simulation. The iteration is started with setting an iteration counter c to the highest ranked variation sample v_(z) and calculate the performance y_(z) of the electrical circuit 1 for this variation sample v_(z).

Thereafter, in a first decision step 32, it is decided whether or not an irregularity (or failure) IR occurred, i.e., whether or not the circuit's calculated performance y_(z) leaves a range of acceptable values and is thus unsatisfactory. When an irregularity IR is detected (branch “y” in the decision 32), an irregularity count IRC is incremented (step 33). In subsequent decision step 34, it is checked whether said irregularity count IRC exceeds a predetermined third threshold TH₃, and if so (branch “y” in the decision 34), the iteration is terminated and the irregularity count IR is output in step 35. In this case, the design of the present electrical circuit 1 is detected to be too much prone to irregularities (or failures) IR.

When, on the other hand, in decision step 34 the irregularity count IRC is found to be lower than said third threshold TH₃ (branch “n” in the decision 34), the iteration counter c is incremented in step 36 and the iteration continues in step 31 with calculating the performance y_(z) of the electrical circuit 1 for the next lower ranked variation sample v_(z). When in decision step 32 no irregularity IR was found (branch “n” in the decision 32), a further decision step 37 follows. In the decision 37, it is checked whether any irregularities IR have occurred in the past iterations, i.e., for a predetermined number CC of immediately previous consecutive calculations of the performance y_(z). When the number of past iterations without occurrence of an irregularity IR exceeds said predetermined number CC (branch “y” in the decision 37), it is supposed that no (or only very few) more irregularities IR are likely to occur in future calculations of the performance y_(z) in the iteration as further variation sample v_(z) are lower ranked and thus their influence on the performance y_(z) of the electrical circuit 1 is expected to be lower. Hence, the iteration is terminated and the irregularity count IRC is output in step 35.

When, on the other hand, in the decision 37 it is found that one or more irregularities IR have occurred within said predetermined number CC of previous consecutive calculations (branch “n” in the decision 37), the iteration counter c is incremented in step 36 and the iteration continues in step 31 with calculating the performance y_(z) of the electrical circuit 1 for the next lower ranked variation sample v_(z).

Embodiments of the invention can be implemented as a computer program executed on a Personal Computer, smartphone or tablet PC. Particularly, the electronic device can be implemented as a Personal Computer, smartphone or tablet PC device running a method according to the invention.

Embodiments of the invention can be implemented in digital electronic circuitry, in tangibly-embodied computer software or firmware, in computer hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments can be implemented as computer programs, i.e., modules of computer program instructions encoded on a tangible non transitory program carrier for execution by data processing apparatus. The computer storage medium can be a machine-readable storage device, a random or serial access memory device, or a combination of one or more of them.

A computer program according to the invention can be written in any form of programming language, including compiled or interpreted languages, or declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program may correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data, e.g., one or more scripts stored in a markup language document, in a single file dedicated to the program in question, or in multiple coordinated files, e.g., files that store one or more modules, sub programs, or portions of code. Such computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described herein can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can be performed by, and apparatus can also be implemented as, special purpose logic circuitry, such as an FPGA (field programmable gate array), an ASIC (application specific integrated circuit), or a GPU (General purpose graphics processing unit). Computers suitable for the execution of the method according to the invention can be based on either of general or special purpose microprocessors, or any other kind of central processing unit (CPU). Such central processing unit will receive instructions and data from a read only memory or a random access memory or both.

The essential elements of a computer are a central processing unit for performing or executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices.

Moreover, a computer according to the invention can be embedded in another device, e.g., a mobile telephone, a smartphone, a tablet device, a mobile audio or video player, a game console, a Global Positioning System (GPS) receiver, or a portable storage device, e.g., a universal serial bus (USB) flash drive.

Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

To provide for interaction with a user, embodiments of the invention can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer.

Embodiments of the subject matter described in this specification can be implemented in a computing system that includes a back end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back end, middleware, or front end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), e.g., the Internet.

The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of the invention. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous.

Moreover, the separation of various system modules and components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.

Particular embodiments of the subject matter have been described. Other embodiments are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. 

The invention claimed is:
 1. A computer-implemented method for detecting, in a netlist representing an electrical circuit with electrical components M_(g) subject to variations δ of their model parameters x_(j), those components M_(g)* the model parameter variations δ of which have the strongest influence on a given performance metric y_(n) of the electrical circuit, comprising the following steps: receiving, by an Interface Unit, the netlist, and extracting a topology Q of the circuit (1), the model parameters x_(j) of all components M_(g) of the circuit, the variations δ of all model parameters; generating, by a Sampling Unit, preferably a Monte Carlo Simulation Unit, a multitude N of variation samples v_(n), each comprising a different set of candidate variations x′_(j) of the model parameters x_(j); calculating, by a Circuit Simulation Unit, preferably using a SPICE simulator, for each variation sample v_(n), the performance metric y_(n) of the circuit and a deviation from a predetermined standard performance metric of the circuit, the deviations for all variation samples v_(n) of the multitude forming a deviation vector y_(D); and running, by an Optimization Unit, a numerical regression analysis, preferably an iterative orthogonal matching pursuit, on the variation samples v_(n) and the deviation vector y_(D) in order to detect M_(g)*; wherein the topology Q of the electric circuit is analyzed by a Topology Analyzing Unit and topological patterns P_(k) are determined, which are formed by two or more electrically interconnected components M_(g), such as interconnected transistors, and said topological patterns P_(k) are passed on to the Optimization Unit, where they are used to improve the regression analysis by introducing additional dependencies between the candidate variations x′_(j) of the model parameters x_(j).
 2. The method according to claim 1, characterized in that it comprises the following steps: by a Preconditioning Unit being integrated with or connected to the Optimization Unit: generating, for each topological pattern P_(k), at least one topological parameter t_(k) which is composed of the model parameters x_(j) of the electrical components M_(g) interconnected in said topological pattern P_(k); appending, to each variation sample v_(n), for each topological parameter t_(k), a candidate variation dependent on the candidate variations x′_(j) of the respective model parameters x_(j) of the electrical components interconnected in said topological pattern; and establishing, for each of the topological and model parameters t′_(j) and x′_(j), a variation vector w_(u) comprising all candidate variations t′_(j) and x′_(j) of all variation samples v_(n) of the multitude N; setting the deviation vector y_(D) as a starting-point for a residual vector r_(c) in the iterative orthogonal matching pursuit; by the Optimization Unit, in each iteration step of the orthogonal matching pursuit: finding a variation vector w_(u) which best matches the residual vector r_(c) and adding said variation vector w_(u) to a first group E₁, determining for each variation vector w_(u) of said first group E₁, a weight factor f_(c) such that the sum of all variation vectors w_(u) of the first group E₁, weighted with their respective weight factors f_(c), approximates the deviation vector y_(D), and setting a remainder p of said approximation as the residual vector r_(c) for the next iteration step, until the remainder ρ falls below a predetermined first threshold TH₁; by the Optimization Unit, identifying the components M_(g)* as members of the respective variation vectors w_(u) comprised in the first group E₁.
 3. The method according to claim 2, wherein each topological parameter t_(k) is generated according to: $t_{k} = {\sum\limits_{j}^{J_{k}}{s_{jk}b_{jk}x_{jk}}}$ with: t_(k) being the topological parameter of the k^(th) topological pattern P_(k); J_(k) being a total number of model parameters of P_(k); x_(jk) being the j^(th) model parameter in P_(k); and s_(jk), b_(jk) being size and bias coefficients of said j^(th) model parameter.
 4. The method according to claim 1, characterized in that it comprises the following steps: by a Preconditioning Unit being integrated with or connected to the Optimization Unit: establishing, for each of the model parameters x_(j), a variation vector w_(u) comprising all candidate variations x′_(j) of all variation samples v_(n) of the multitude N; setting said deviation vector y_(D) as a starting-point for a residual vector r_(c) in said iterative orthogonal matching pursuit; by the Optimization Unit, in each iteration step of the orthogonal matching pursuit: finding a predetermined number of variation vectors w_(u) which best match the residual vector r_(c), selecting, for each best-matching variation vector w_(u) found, the topological pattern P_(k) in which that electrical component M_(g) is interconnected in, which has the model parameter x_(j) for which said variation vector w_(u) was established, finding, from the selected topological patterns P_(k), that topological pattern P_(k) the variation vectors w_(u) of the model parameters x_(j) of the electrical components M_(g) interconnected therein collectively best match the residual vector r_(c), and adding said variation vectors w_(u) of the found topological pattern P_(k) to a second group E₂, determining, for each variation vector w_(u) of said second group E₂, a weight factor f_(c) such that the sum of all variation vectors w_(u) of said second group E₂, weighted with their respective weight factors f_(c), approximates the deviation vector y_(D), and setting a remainder ρ of said approximation as the residual vector r_(c) for the next iteration step, until the remainder ρ falls below a predetermined second threshold TH₂; by the Optimization Unit, identifying the components M_(g)* as members of the variation vectors w_(u) comprised in the second group E₂.
 5. The method according to claim 4, wherein said step of finding that topological pattern P_(k) the variation vectors w_(u) of which collectively best match the residual vector r_(c) is terminated when, for each of the selected topological patterns P_(k), a predetermined number of variation vectors w_(u) which best match the residual vector r_(c) have been found.
 6. The method according to claim 5, wherein said predetermined number of variation vectors w_(u) which best match the residual vector r_(c) is two.
 7. The method according to claim 2, wherein said determining the weight factor f_(c) comprises a method of least squares.
 8. The method according to claim 2, wherein each variation vector w_(u) is normalized by its variance.
 9. The method according to claim 2, further comprising the steps of: generating, by the Sampling Unit, a multitude of further variation samples v_(z); estimating, by a Postprocessing Unit, for each further variation sample v_(z), a performance deviation Δy_(z) using the weight factors f_(c) of the variation vectors w_(u) by which said electrical components M_(g)* were identified; ranking, by the Postprocessing Unit, said further variation samples v_(z) according to said estimated performance deviations Δy_(z); calculating, by the Circuit Simulation Unit, a performance y_(z) of the circuit for each further variation sample v_(z) in the sequence of the ranking; comparing, by the Postprocessing Unit, the performance y_(z) of the circuit with a predetermined model performance and incrementing an irregularity count IRC with each irregularity in the circuit's calculated performance y_(z) as compared to the model performance until either no irregularity occurs for a predetermined number of consecutive calculations or said irregularity count exceeds a predetermined third threshold TH₃; and outputting, by an Output Unit, the irregularity count (IRC).
 10. The method of claim 1, wherein the topological patterns P_(k) are determined by running a nodal analysis using Kirchhoff's current law (KCL) and/or a mesh analysis using Kirchhoff's voltage law (KVL).
 11. The method of claim 1, wherein the topological patterns P_(k) are determined by evaluating the similarity of the topology to one or more predetermined target patterns, which preferably include two or more transistors with interconnected terminals.
 12. A computer-readable medium comprising computer-executable instructions causing an electronic device to perform the method according to claim
 1. 13. An electronic device comprising a processing unit, an electronic memory, and a communication unit, which is adapted to execute a method according to claim 1, comprising a. an Interface Unit, adapted to receive a netlist and extract a topology Q of an electronic circuit, the model parameters x^(j) of all components M_(g) of the circuit, and the variations δ of all model parameters; b. a Sampling Unit, preferably comprising a Monte Carlo Simulation Unit, adapted to generate a multitude N of variation samples v_(n), each comprising a different set of candidate variations x′_(j) of the model parameters x_(j); c. a Circuit Simulation Unit, such as a SPICE simulator, adapted to calculate for each variation sample v_(n) a performance metric y_(n) of the circuit and a deviation from a predetermined standard performance metric of the circuit, the deviations for all variation samples v_(n) of the multitude forming a deviation vector y_(D); and d. an Optimization Unit, adapted to run a numerical regression analysis, preferably an iterative orthogonal matching pursuit, on the variation samples v_(n) and the deviation vector y_(D) in order to detect those components M_(g)* the model parameter variations δ of which have the strongest influence on the performance metric y_(n) of the electrical circuit; characterized in that it comprises a Topology Analyzing Unit adapted to analyze the topology Q of the electric circuit and determine topological patterns P_(k), which are formed by two or more electrically interconnected components M_(g), such as interconnected transistors, and pass said topological patterns P_(k) to the Optimization Unit, which is adapted to use them to improve the regression analysis by introducing additional dependencies between the candidate variations x′_(j) of the model parameters x_(j).
 14. An electronic device according to claim 13, further comprising: a. a Preconditioning Unit which is integrated with or connected to the Optimization Unit and which is adapted to i. generate, for each topological pattern P_(k), at least one topological parameter t_(k) which is composed of the model parameters x_(j) of the electrical components M_(g) interconnected in said topological pattern P_(k); ii. append, to each variation sample v_(n), for each topological parameter t_(k), a candidate variation t′_(j) dependent on the candidate variations x′_(j) of the respective model parameters x_(j) of the electrical components interconnected in said topological pattern; and iii. establish, for each of the topological and model parameters t′_(j) and x′_(j), a variation vector w_(u) comprising all candidate variations t′_(j) and x′_(j) of all variation samples v_(n) of the multitude N; iv. set the deviation vector y_(D) as a starting-point for a residual vector r_(c) in the iterative orthogonal matching pursuit; wherein the Optimization Unit is further adapted to, in each iteration step of the orthogonal matching pursuit, b. find a variation vector w_(u) which best matches the residual vector r_(c) and adding said variation vector w_(u) to a first group E₁, c. determine for each variation vector w_(u) of said first group E₁, a weight factor f_(c) such that the sum of all variation vectors w_(u) of the first group E₁, weighted with their respective weight factors f_(c), approximates the deviation vector y_(D), and d. set a remainder ρ of said approximation as the residual vector r_(c) for the next iteration step, until the remainder ρ falls below a predetermined first threshold TH₁; wherein the Optimization Unit is further adapted to identify the components M_(g)* as members of the respective variation vectors w_(u) comprised in the first group E₁.
 15. An electronic device according to claim 13, characterized in that it further comprises: a Preconditioning Unit which is integrated with or connected to the Optimization Unit and adapted to a. establish, for each of the model parameters x_(j), a variation vector w_(u) comprising all candidate variations x′_(j) of all variation samples v_(n) of the multitude N; b. set said deviation vector y_(D) as a starting-point for a residual vector r_(c) in said iterative orthogonal matching pursuit; wherein the Optimization Unit is adapted to, in each iteration step of the orthogonal matching pursuit: c. find a predetermined number of variation vectors w_(u) which best match the residual vector r_(c), d. select, for each best-matching variation vector w_(u) found, the topological pattern P_(k) in which that electrical component M_(g) is interconnected in, which has the model parameter x_(j) for which said variation vector w_(u) was established, e. find, from the selected topological patterns P_(k), that topological pattern P_(k) the variation vectors w_(u) of the model parameters x_(j) of the electrical components M_(g) interconnected therein collectively best match the residual vector r_(c) , and adding said variation vectors w_(u) of the found topological pattern P_(k) to a second group E₂, f. determine, for each variation vector w_(u) of said second group E₂, a weight factor f_(c) such that the sum of all variation vectors w_(u) of said second group E₂, weighted with their respective weight factors f_(c), approximates the deviation vector y_(D), and g. set a remainder ρ of said approximation as the residual vector r_(c) for the next iteration step, until the remainder ρ falls below a predetermined second threshold TH₂; wherein the Optimization Unit is adapted to identify the components M_(g)* as members of the variation vectors w_(u) comprised in the second group E₂.
 16. An electronic device according to claim 13, characterized in that the Sampling Unit is adapted to generate a multitude of further variation samples v_(z) and it further comprises a Postprocessing Unit and an Output Unit, wherein a. the Postprocessing unit is adapted to estimate, for each further variation sample v_(z), a performance deviation Δy_(z) using the weight factors f_(c) of the variation vectors w_(u) by which said electrical components M_(g)* were identified; and rank said further variation samples v_(z) according to said estimated performance deviations Δy_(z); b. the Circuit Simulation Unit is adapted to calculate a performance y_(z) of the circuit for each further variation sample v_(z) in the sequence of the ranking; c. the Postprocessing Unit is further adapted to compare the performance y_(z) of the circuit with a predetermined model performance and increment an irregularity count IRC with each irregularity in the circuit's calculated performance y_(z) as compared to the model performance until either no irregularity occurs for a predetermined number of consecutive calculations or said irregularity count exceeds a predetermined third threshold TH₃; and d. the Output Unit is adapted to output the irregularity count (IRC).
 17. An electronic device according to claim 13, characterized in that the Topology Analyzing Unit is adapted to determine the topological patterns P_(k) by running a nodal analysis using Kirchhoff's current law (KCL) and/or a mesh analysis using Kirchhoff's voltage law (KVL).
 18. An electronic device according to claim 13, characterized in that the Topology Analyzing Unit is adapted to determine the topological patterns P_(k) by evaluating the similarity of the topology to one or more predetermined target patterns, which preferably include two or more transistors with interconnected terminals. 